Fine hierarchies and m-reducibilities in theoretical computer science
نویسنده
چکیده
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and related techniques play a crucial role in understanding complexity of finite and infinite computations. We try not only to present the corresponding notions and facts from the particular fields but also to identify the unifying notions, techniques and ideas.
منابع مشابه
Lipschitz and uniformly continuous Reducibilities on Ultrametric polish spaces
We analyze the reducibilities induced by, respectively, uniformly continuous, Lipschitz, and nonexpansive functions on arbitrary ultrametric Polish spaces, and determine whether under suitable set-theoretical assumptions the induced degree-structures are well-behaved.
متن کاملStrong and Robustly Strong Polynomial Time Reducibilities to Sparse Sets
GavaldB, R. and J.L. BalcBzar, Strong and robustly strong polynomial time reducibilities to sparse sets, Theoretical Computer Science 88 (1991) I-14. Reducibility defined by oracle strong nondeterministic machines is studied. Two definitions of relativized strength are presented and separated. The corresponding reduction classes of the sparse sets give two nonuniform analogs of the class NPncoN...
متن کاملApplication of modified balanced iterative reducing and clustering using hierarchies algorithm in parceling of brain performance using fMRI data
Introduction: Clustering of human brain is a very useful tool for diagnosis, treatment, and tracking of brain tumors. There are several methods in this category in order to do this. In this study, modified balanced iterative reducing and clustering using hierarchies (m-BIRCH) was introduced for brain activation clustering. This algorithm has an appropriate speed and good scalability in dealing ...
متن کاملA model for employer’s decision for recruitment
This paper presents a theoretical and empirical analysis of this decision and how it relates to wage setting and the provision of general training. The theoretical framework is a promotion tournament involving M competing firms with heterogeneous productivities, two-level job hierarchies, and a fixed number of managerial positions. This paper also considers an alternative model based on variati...
متن کاملThe Global Power of Additional Queries to p-Random Oracles
We consider separations of reducibilities by random sets. First, we show a result on polynomial time-bounded reducibilities that query their oracle nonadaptively: for every p-random set R, there is a set that is reducible to R with k + 1 queries but is not reducible to any other p-random set with at most k queries. This result solves an open problem stated in a recent survey paper by Lutz and M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 405 شماره
صفحات -
تاریخ انتشار 2008